Combinatorial Construction of Locally Testable Codes ∗ Or Meir
نویسنده
چکیده
>IJH=?J An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constant number of symbols of the string. While the best known construction of LTCs by Ben-Sasson and Sudan (STOC 2005) and Dinur (J. ACM 54(3)) achieves very ecient parameters, it relies heavily on algebraic tools and on PCP machinery. In this work we present a new and arguably simpler construction of LTCs that is purely combinatorial, does not rely on PCP machinery and matches the parameters of the best known construction. However, unlike the latter construction, our construction is not entirely explicit.
منابع مشابه
Combinatorial Construction of Locally Testable Codes ∗ Or Meir † May 10 , 2010
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constant number of symbols of the string. While the best known construction of LTCs by Ben-Sasson and Sudan (STOC 2005) and Dinur (J. ACM 54(3)) achieves very ecient parameters, it relies heavily on algebraic tools and on PCP...
متن کاملA Combination of Testability and Decodability by Tensor Products
Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable. Due to the requirement of a very large distance the associated tensor products could be applied only over sufficiently large fields. Then Meir (SICOMP 2009) used this result (as a black box) to present a combinatorial construction of locally testable codes that m...
متن کاملTowards Lower Bounds on Locally Testable Codes
1 Abbreviations and Notations 3 1 General Introduction 4 1.1 PCP theorem . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Property Testing . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.3 Locally Testable Codes . . . . . . . . . . . . . . . . . . . . . . 6 1.3.1 Random locally testable codes . . . . . . . . . . . . . 6 1.3.2 Algebraic Construction of LTCs . . . . . . . . . . ....
متن کاملHigh-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a small number of symbols of the string. Locally testable codes (LTCs) are both interesting in their own right, and have important applications in complexity theory. A long line of research tries to determine the best tradeoff ...
متن کاملLocally Testable Codes and PCPs of Almost - Linear Length ( Preliminary
Locally testable codes are error-correcting codes that admit very eecient codeword tests. Speciically, using a constant number of (random) queries, non-codewords are rejected with probability proportional to their distance from the code. Locally testable codes are believed to be the combinatorial core of PCPs. However, the relation is less immediate than commonly believed. Nevertheless, we show...
متن کامل